on the values of independence and domination polynomials at specific points
نویسندگان
چکیده
let $g$ be a simple graph of order $n$. we consider the independence polynomial and the domination polynomial of a graph $g$. the value of a graph polynomial at a specific point can give sometimes a very surprising information about the structure of the graph. in this paper we investigate independence and domination polynomial at $-1$ and $1$.
منابع مشابه
A note on the values of independence polynomials at -1
Nathan Kahl∗, Hannah Quense, and Tara Wager, Seton Hall University The independence polynomial I(G;x) of a graph G is I(G;x) = ∑n k=0 skx , where sk is the number of independent sets in G of size k. The decycling number of a graph G, denoted φ(G), is the minimum size of a set S ⊆ V (G) such that G− S is acyclic. Engström proved that the independence polynomial satisfies |I(G;−1)| ≤ 2 for any gr...
متن کاملOn common values of lacunary polynomials at integer points
For fixed ` ≥ 2, fixed positive integers m1 > m2 with gcd(m1,m2) = 1 and n1 > n2 > · · · > n` with gcd(n1, . . . , n`) = 1, and fixed rationals a1, a2, . . . , a`+1, b1, b2 which are all nonzero except for possibly a`+1, we show the finiteness of integral solutions x, y of the equation a1x n1 + · · ·+ a`x` + a`+1 = b1y + b2y , when n1 ≥ 3, m1 ≥ 2`(` − 1), and (n1, n2) 6= (m1,m2). In relation to...
متن کاملleadership styles of tefl instructors at gilan university and their effects on the students attitudes and motivation
the subjects of the study are only the tefl teachers and students at gilan university. to obtain the desired data, a questionnaire which was based on the theories and disecussions gathered, was used as the main data gathering instrument. to determine the degree of relationship between variables, covariance and pearson product moment correlation coefficient were the formulas applied. the data we...
15 صفحه اولOn the domination polynomials of non P4-free graphs
A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...
متن کاملthe effects of multiple intelligences (focus on musical, visual, and linguistic) and direct instruction on learning grammar: a case on iranian efl students at elementary level
1.0 overview it seems that grammar plays a crucial role in the area of second and foreign language learning and widely has been acknowledged in grammar research. in other words, teaching grammar is an issue which has attracted much attention to itself, and a lot of teachers argue about the existence of grammar in language teaching and learning. this issue will remind us a famous sentence f...
Some Results on the Field of Values of Matrix Polynomials
In this paper, the notions of pseudofield of values and joint pseudofield of values of matrix polynomials are introduced and some of their algebraic and geometrical properties are studied. Moreover, the relationship between the pseudofield of values of a matrix polynomial and the pseudofield of values of its companion linearization is stated, and then some properties of the augmented field of ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
transactions on combinatoricsناشر: university of isfahan
ISSN 2251-8657
دوره 1
شماره 2 2012
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023